1948C - Arrow Path - CodeForces Solution


dfs and similar dp graphs shortest paths shortest paths

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    n = int(input())
    s1 = input()
    s2 = input()
    for i in range(1, n, 2):
        if (i+1<n  and s1[i]==s2[i+1]=='<') or (s1[i]==s2[i - 1]=='<'):
            print("NO")
            break
    else:
        print("YES")
        


Comments

Submit
0 Comments
More Questions

1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols
1213A - Chips Moving
490A - Team Olympiad
233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians